就開一個長度為n 的陣列，記錄前後差的數值是否出現過再從1~n 之間，開始搜索哪一個未出現過，只要有找到就不是Jolly Jumpers ... ... <看更多>

Jolly jumpers bouncy castles. 1691 likes · 1 talking about this. Jolly jumpers are NOW taking bookings for DISCO DOME & COMBI CASTLE POPCORN and CANDY... ... <看更多>

20180115 jlhung v1.0. ''' while True: try: a = list(map(int, input().split())). except EOFError: break. n = [0 for i in range(3001)]. ... <看更多>

According to the definition, it's jolly if each difference from 1..n-1 occurs once. This implies each difference should be unique. ... <看更多>